Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposedinto two subproblems sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an...
متن کاملMachine scheduling with earliness, tardiness and non-execution penalties
The study of scheduling problems with earliness–tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملPermutation Flowshop Scheduling with Earliness and Tardiness Penalties
The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...
متن کاملA branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2007
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-007-0284-z